package com.LeetCode.String;


import org.junit.Test;

/**
 * 编辑距离
 */
public class editDistance {


    public int minDistance(String word1, String word2) {
        int n = word1.length(), m = word2.length();
        int[][] dp = new int[n+1][m+1];

        //base case
        for(int i = 0; i <= n; i++){
            dp[i][0] = i;
        }
        for(int i = 0; i <= m; i++){
            dp[0][i] = i;
        }
        for(int i = 1; i <= n ; i++){
            for(int j = 1; j <= m; j++){
                if(word1.charAt(i-1) == word2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1];
                }else{
                    dp[i][j] = min(
                            dp[i-1][j] + 1,
                            dp[i][j-1] + 1,
                            dp[i-1][j-1] + 1
                    );
                }
            }
        }
        return dp[n][m];
    }

    private int min(int a, int b, int c){
        return Math.min(Math.min(a,b),c);
    }

    @Test
    public void test(){
        String word1 = "horse";
        String word2 = "ros";
        System.out.println(minDistance(word1,word2));
    }
}
